bit-array representation

См. также в других словарях:

• Bit array — A bit array (or bitmap, in some cases) is an array data structure which compactly stores individual bits (boolean values). It implements a simple set data structure storing a subset of {1,2,..., n } and is effective at exploiting bit level… …   Wikipedia

• Bit — This article is about the unit of information. For other uses, see Bit (disambiguation). Fundamental units of information bit (binary) nat (base e) ban (decimal) qubit (quantum) This box …   Wikipedia

• Array data type — Not to be confused with Array data structure. In computer science, an array type is a data type that is meant to describe a collection of elements (values or variables), each selected by one or more indices that can be computed at run time by the …   Wikipedia

• Board representation (chess) — In computer chess, software developers must choose a data structure to represent chess positions. Several data structures exist, collectively known as board representations. [ [http://www.cis.uab.edu/hyatt/boardrep.html Hyatt full article] ]… …   Wikipedia

• External Data Representation — (XDR) is an IETF standard from 1995 of the presentation layer in the OSI model. XDR allows data to be wrapped in an architecture independent manner so data can be transferred between heterogeneous computer systems. Converting from the local… …   Wikipedia

• Genetic representation — is a way of representing solutions/individuals in evolutionary computation methods. Genetic representation can encode appearance, behavior, physical qualities of individuals. Designing a good genetic representation that is expressive and… …   Wikipedia

• Hash table — Not to be confused with Hash list or Hash tree. Unordered map redirects here. For the proposed C++ class, see unordered map (C++). Hash Table Type unsorted dictionary Invented 1953 Time complexity in big O notation Average Worst case Space …   Wikipedia

• Linked list — In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference (in other words, a link) to the next node in the… …   Wikipedia

• Enumerated type — In computer programming, an enumerated type is a data type (usually user defined) consisting of a set of named constants called enumerators . The act of creating an enumerated type defines an enumeration. When an identifier such as a variable is… …   Wikipedia

• Bitboard — A bitboard is a data structure commonly used in computer systems that play board games. Definition A bitboard, often used for boardgames such as chess, checkers and othello, is a specialization of the bitset data structure, where each bit… …   Wikipedia

• Van Emde Boas tree — A van Emde Boas tree (or van Emde Boas priority queue), also known as a vEB tree, is a tree data structure which implements an associative array with m bit integer keys. It performs all operations in O(log m ) time. Notice that m is the size of… …   Wikipedia